Imposing penalties for vaccine rejection requires strong scrutiny

A note on imposing strong complementary slackness conditions in DEA

A new DEA model has been introduced recently combining the primal and the dual models in order to impose strong complementary slackness conditions. It was claimed that a reference set that contains the maximum number of efficient units can then be determined. The model is very interesting as a theoretical idea. However, not only does the computational burden increase significantly, but it seems...

Strong rules for nonconvex penalties and their implications for efficient algorithms in high-dimensional regression

We consider approaches for improving the efficiency of algorithms for fitting nonconvex penalized regression models such as SCAD and MCP in high dimensions. In particular, we develop rules for discarding variables during cyclic coordinate descent. This dimension reduction leads to a substantial improvement in the speed of these algorithms for high-dimensional problems. The rules we propose here...

SUMMATION TEST FOR GAP PENALTIES AND STRONG LAW OF THE LOCAL ALIGNMENT SCORE By Hock

A summation test is proposed to determine admissible types of gap penalties for logarithmic growth of the local alignment score. We also define a converging sequence of log moment generating functions that provide the constants associated with the large deviation rate and logarithmic strong law of the local alignment score and the asymptotic number of matches in the optimal local alignment. Abb...

Adaptive penalties for evolutionary

In this paper we consider a problem independent constraint handling mechanism, Stepwise Adaptation of Weights (SAW) and show its working on graph coloring problems. SAWing technically belongs to the penalty function based approaches and amounts to modifying the penalty function during the search. We show that it has a twofold ben-eet. First, it proves to be rather insensitive to its technical p...

Under Scrutiny